Complete Local Search with Memory
نویسندگان
چکیده
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic that makes effective use of memory structures in a way that is different from tabu search. We report computational experiments with this heuristic on the traveling salesperson problem and the subset sum problem.
منابع مشابه
Predicting Normal People’s Reaction Time based on Hippocampal Local Efficiency During a Memory-Guided Attention Task
Background: There are some convincing shreds of evidence indicating that memory can direct attention. The local efficiency of an area in the brain, as a quantitative feature in a complex network, indicates how the surrounding nodes can transfer the information when a specific node is omitted. This feature is a scale for measuring efficient integration of information in the brain. Objectives:...
متن کاملExtending Systematic Local Search for Job Shop Scheduling Problems
Hybrid search methods synthesize desirable aspects of both constructive and local search methods. Constructive methods are systematic and complete, but exhibit poor performance on large problems because bad decisions made early in the search persist for exponentially long times. In contrast, stochastic local search methods are immune to the tyranny of early mistakes. Local search methods replac...
متن کاملOPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملTSDLMRA: an efficient multicast routing algorithm based on Tabu search
As a NP-Complete problem, multicast routing with delay constraint is a research difficulty in routing problem. Tabu Search is artificial intelligence algorithm, which is an extension of local search algorithm and has simple realization and well properties. In this paper, an efficient algorithm based on Tabu Search for Delay-Constrained Low-Cost Multicast Routing is proposed to solve delay-const...
متن کاملA Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Heuristics
دوره 8 شماره
صفحات -
تاریخ انتشار 2002